Contention-free executions for real-time multiprocessor scheduling
نویسندگان
چکیده
منابع مشابه
Multi-level contention-free policy for real-time multiprocessor scheduling
The contention-free policy has received attention in real-time multiprocessor scheduling owing to its wide applicability and significant improvement in offline schedulability guarantees. Utilizing the notion of contention-free slots in which the number of active jobs is smaller than or equal to the number of processors, the policy improves the schedulability by offloading executions in contendi...
متن کاملScheduling Strategies for Multiprocessor Real - Time Dsp '
completely addressed, either in the deterministic scheduling literature ABSTRACT or in the multiprocessor systems literature. This paper will attempt to define these. Real-time digital signal processing often requires multiple processors. We assume the description of the program to be scheduled is a Unfortunately, in most practical situations, partitioning of DSP applicadataflow graph, signal f...
متن کاملHybrid Multiprocessor Real-Time Scheduling Approach
Real-time scheduling is one of the most important aspects of a real-time system design. To achieve a real-time system’s requirement, especially to be fast, multiprocessor systems are used. Generally, multiprocessor real-time scheduling algorithms fall into one the two well-known approaches: Partitioning or Global. The partitioning approach has acceptable overhead for underlying system but can N...
متن کاملAn Optimal Multiprocessor Real-Time Scheduling Algorithm
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisses certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single t...
متن کاملZero-laxity based real-time multiprocessor scheduling
It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies have developed optimal scheduling policies for implicit deadline task systems. So far however, studies have failed to develop effective scheduling strategies for more general task systems such as constrained deadline tasks. We argue that a narrow focus on deadline satisfaction (urgency) is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Embedded Computing Systems
سال: 2014
ISSN: 1539-9087,1558-3465
DOI: 10.1145/2494530